/*
 * Copyright 2015 MingxingWang

 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at

 *     http://www.apache.org/licenses/LICENSE-2.0

 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.audaque.graphdb

import org.apache.spark.graphx._

import scala.collection.immutable.Set
import scala.collection.mutable

/**
 * Created by Ming on 2015/3/28.
 */
abstract class EdgePartitions {

  def count(): Long

  def findEdge(srcId: VertexId, dstId: VertexId): Option[Edge]
  
  def findEdges(vids: Set[(VertexId, VertexId)]): Option[Set[Edge]]

  def transformBuffer2Partition(addBuffer: mutable.Map[VertexId, mutable.Map[VertexId, Property]]): Unit

  def updatePartitionWithDeleteBuff(deleteBuffer: mutable.Map[VertexId, mutable.Set[VertexId]]): Unit

  def findOutVertexIds(vid: VertexId, filter: Property => Boolean = edge => true): Option[Set[VertexId]]

  def findOutEdges(vid: VertexId, filter: Property => Boolean = edge => true): Option[Map[VertexId, Property]]

  def findOutEdgesBatch(vids: Set[VertexId], filter: Property => Boolean = prop => true)
  : mutable.HashMap[VertexId, Option[mutable.HashMap[VertexId, Property]]]
  
  def reverse(): EdgePartitions

  def clear()
}
